Variable-rate source coding theorems for stationary nonergodic sources
نویسندگان
چکیده
منابع مشابه
Variable-rate source coding theorems for stationary nonergodic sources
~ The source coding theorem and its converse imply that the optimal performance theoretically achievable by a Axedor variable-rate block quantizer on a stationary ergodic source equals the distortion-rate function. While a Axed-rate block code cannot achieve arbitrarily closely the distortionrate function on an arbitrary stationary nonergodic source, we show for the case of Polish alphabets tha...
متن کاملAlmost-Sure Variable-Length Source Coding Theorems for General Sources
Source coding theorems for general sources are presented. For a source , which is assumed to be a probability measure on all strings of infinite-length sequence with a finite alphabet, the notion of almost-sure sup entropy rate is defined; it is an extension of the Shannon entropy rate. When both an encoder and a decoder know that a sequence is generated by , the following two theorems can be p...
متن کاملFixed-Rate Zero-Delay Source Coding for Stationary Vector-Valued Gauss-Markov Sources
We consider a fixed-rate zero-delay source coding problem where a stationary vector-valued Gauss-Markov source is compressed subject to an average mean-squared error (MSE) distortion constraint. We address the problem by considering the Gaussian nonanticipative rate distortion function (NRDF) which is a lower bound to the zero-delay Gaussian RDF. Then, we use its corresponding optimal “test-cha...
متن کاملStationary quantum source coding
In this paper the quantum version of the source coding theorem is obtained for a completely ergodic source. This result extends Schumacher’s quantum noiseless coding theorem for memoryless sources. The control of the memory effects requires some earlier results of Hiai and Petz on high probability subspaces. Our result is equivalently considered as a compression theorem for noiseless stationary...
متن کاملVariable-Length Resolvability for Mixed Sources and its Application to Variable-Length Source Coding
In the problem of variable-length δ-channel resolvability, the channel output is approximated by encoding a variable-length uniform random number under the constraint that the variational distance between the target and approximated distributions should be within a given constant δ asymptotically. In this paper, we assume that the given channel input is a mixed source whose components may be ge...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Information Theory
سال: 1994
ISSN: 0018-9448
DOI: 10.1109/18.340466